Non- Linear Programming

См. также в других словарях:

• Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

• Non-linear least squares — is the form of least squares analysis which is used to fit a set of m observations with a model that is non linear in n unknown parameters (m > n). It is used in some forms of non linear regression. The basis of the method is to… …   Wikipedia

• Successive linear programming — SLP Successive Linear ProgrammingLinear programming is a powerful technique for optimisation but the requirement that all constraints be linear can make it difficult to write models that represent the real world closely enough to produce useful… …   Wikipedia

• GNU Linear Programming Kit — Original author(s) Andrew O. Makhorin Developer(s) GNU Project Stable release 4.47 / September 9, 2011; 51 days ago ( …   Wikipedia

• Hilbert basis (linear programming) — In linear programming, a Hilbert basis for a convex cone is a minimal set of integer vectors such that every integer vector in the convex cone is a linear combination of the vectors in the Hilbert basis with non negative integer coefficients.More …   Wikipedia

• Linear production game — ( LP Game ) is a N person game in which the value of a coalition can be obtained by solving a Linear Programming problem. It is widely used in the context of resource allocation and payoff distribution. Mathematically, there are m types of… …   Wikipedia

• Linear — The word linear comes from the Latin word linearis , which means created by lines .In advanced mathematics, a linear map or function f ( x ) is a function which satisfies the following two properties:* Additivity (also called the superposition… …   Wikipedia

• Linear inequality — In mathematics a linear inequality is an inequality which involves a linear function.Formal definitionsWhen operating in terms of real numbers, linear inequalities are the ones written in the forms: f(x) < b ext{ or }f(x) leq b,where f(x) is a… …   Wikipedia

• Linear partial information — (LPI) is a method of making decisions based on insufficient or fuzzy information. LPI was introduced in 1970 by Polish Swiss mathematician Edward Kofler (1911 2007) to simplify decision processes. Comparing to other methods the LPI fuzziness is… …   Wikipedia

• Constraint programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin …   Wikipedia

• Linear complementarity problem — In mathematical optimization theory, the linear complementarity problem, or LCP, is a special case of quadratic programming which arises frequently in computational mechanics. Given a real matrix M and vector b, the linear complementarity problem …   Wikipedia